Applying propositional learning algorithms to multi-instance data
نویسندگان
چکیده
Multi-instance learning is commonly tackled using special-purpose algorithms. Development of these algorithms has started because early experiments with standard propositional learners have failed to produce satisfactory results on multi-instance data—more specifically, the Musk data. In this paper we present evidence that this is not necessarily the case. We introduce a simple wrapper for applying standard propositional learners to multi-instance problems and present empirical results for the Musk data that are competitive with genuine multi-instance algorithms. The key features of our new wrapper technique are: (1) it discards the standard multi-instance assumption that there is some inherent difference between positive and negative bags, and (2) it introduces weights to treat instances from different bags differently. We show that these two modifications are essential for producing good results on the Musk benchmark
منابع مشابه
Propositionalisation of Multi-instance Data Using Random Forests
Multi-instance learning is a generalisation of attribute-value learning where examples for learning consist of labeled bags (i.e. multisets) of instances. This learning setting is more computationally challenging than attribute-value learning and a natural fit for important application areas of machine learning such as classification of molecules and image classification. One approach to solve ...
متن کاملProper: A Toolbox for Learning from Relational Data with Propositional and Multi-Instance Learners
Databases predominantly employ the relational model for data storage. To use this data in a propositional learner, a propositionalization step has to take place. Similarly, the data has to be transformed to be amenable to a multi-instance learner. The Proper Toolbox contains an extended version of RELAGGS, the Multi-Instance Learning Kit MILK, and can also combine the multi-instance data with a...
متن کاملExperiments with Multi-view Multi-instance Learning for Supervised Image Classification
In this paper we empirically investigate the benefits of multi-view multi-instance (MVMI) learning for supervised image classification. In multi-instance learning, examples for learning contain bags of feature vectors and thus data from different views cannot simply be concatenated as in the singleinstance case. Hence, multi-view learning, where one classifier is built per view, is particularly...
متن کاملMICCLLR: A Generalized Multiple-Instance Learning Algorithm Using Class Conditional Log Likelihood Ratio
We propose a new generalized multiple-instance learning (MIL) algorithm, MICCLLR (multiple-instance class conditional likelihood ratio), that converts the MI data into a single meta-instance data allowing any propositional classifier to be applied. Experimental results on a wide range of MI data sets show that MICCLLR is competitive with some of the best performing MIL algorithms reported in li...
متن کاملLearning Rules from Multiple Instance Data: Issues and Algorithms
In a multiple-instance representation, each learning example is represented by a “bag” of fixed-length “feature vectors”. Such a representation, lying somewhere between propositional and first-order representation, offers a tradeoff between the two. This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. It describes NAIVE-RIPPERMI, an implementa...
متن کامل